3 April 2014, Algebra|Coalgebra Seminar, Fatemeh Seifan

Abstract
In this talk we will use the connection between automata and logic to prove that a wide class of coalgebraic fixpoint logics enjoy the uniform interpolation. To this aim, first we generalize one of the central results in coalgebraic automata theory, namely closure under projection, which is known to hold for weak-pullback preserving functors, to a more general class of functors, i.e.; functors with quasi-functorial lax extensions. Then we will show thatclosure under projection implies definability of the bisimulation quantifier in the language of coalgebraic fixpoint logic, and finally we prove the uniform interpolation theorem.

For more information, see http://www.illc.uva.nl/alg-coalg/ or contact Sumit Sourabh (S.Sourabh at uva.nl).